Financial laws as algebraic automata
نویسندگان
چکیده
It is shown that the concept of financial law has the structure of an automaton. Furthermore, a financial law induces a group structure into the monoid of the automaton. The concepts of stationary, stationary of order n, and dynamic financial laws are deduced, proving two algebraic characterizations. Finally the concept of a-stationary financial law and some applications are introduced. 2001 John Wiley & Sons, Inc.
منابع مشابه
Weighted finite automata over strong bimonoids
We investigate weighted finite automata over strings and strong bimonoids. Such algebraic structures satisfy the same laws as semirings except that no distributivity laws need to hold. We define two different behaviors and prove precise characterizations for them if the underlying strong bimonoid satisfies local finiteness conditions. Moreover, we show that in this case the given weighted autom...
متن کاملSOME HYPER K-ALGEBRAIC STRUCTURES INDUCED BY MAX-MIN GENERAL FUZZY AUTOMATA
We present some connections between the max-min general fuzzy automaton theory and the hyper structure theory. First, we introduce a hyper BCK-algebra induced by a max-min general fuzzy automaton. Then, we study the properties of this hyper BCK-algebra. Particularly, some theorems and results for hyper BCK-algebra are proved. For example, it is shown that this structure consists of different ty...
متن کاملOn Elementary and Algebraic Cellular Automata
In this paper we study elementary cellular automata from an algebraic viewpoint. The goal is to relate the emergent complex behavior observed in such systems with the properties of corresponding algebraic structures. We introduce algebraic cellular automata as a natural generalization of elementary ones and discuss their applications as generic models of complex systems. There is a great divers...
متن کاملA Bialgebraic Review of Regular Expressions, Deterministic Automata and Languages
This papers reviews the classical theory of deterministic automata and regular languages from a categorical perspective. The basis is formed by Rutten's description of the Brzozowski automaton structure in a coalgebraic framework. We enlarge the framework to a so-called bialgebraic one, by including algebras together with suitable distributive laws connecting the algebraic and coalgebraic struc...
متن کاملApplications of a group in general fuzzy automata
Let $tilde{F}=(Q,S,tilde{R},Z,omega,tilde{delta}, F_1,F_2)$ be a general fuzzy automaton and the set of its states be a group. The aim of this paper is the study of applications of a group in a general fuzzy automaton. For this purpose, we define the concepts of fuzzy normal kernel of a general fuzzy automaton, fuzzy kernel of a general fuzzy automaton, adjustable, multip...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Intell. Syst.
دوره 16 شماره
صفحات -
تاریخ انتشار 2001